Weak Matching Points with Triangles
نویسندگان
چکیده
In this paper, we study the weak point matching problem for a given set of n points and a class of equilateral triangles. The problem is to find the maximum cardinality matching of the points using equilateral triangles such that each triangle contains exactly two points and each point lies at most in one triangle. Under the non-degeneracy assumption, we present an O(n) time algorithm using the TD-Delaunay graph and a graph matching algorithm. Also, we show that the lower bound for the number of matched points is b2n/3c which is optimal in the worst case.
منابع مشابه
Curve Matching for Spine X-ray Image Retrieval using Dynamic Programming
Detection of medical information such as osteophyte on spine xray images is an important task for spine x-ray image retrieval. Curve matching can be used to match partial shapes for image retrieval. Using a curve segment that contains osteophyte information as the query for matching provides more accurate retrieval information than whole shape matching. This paper presents curve matching method...
متن کاملCopy move forgery detection by matching triangles of key points via multi-scale analysis and voting processes
-One of the most common type of tempering the digital images is copy image forgery. As this work gives a new approach for detecting copy image forgery. As earlier detection methods are used for copy image forgery that basically use block matching approaches that firstly divide the images into overlap blocks and then find out the similar ones. As in this paper hybrid approach is used with new al...
متن کاملCopy-Move Forgery Detection by Matching Triangles of Keypoints
— Copy-move forgery is one of the most common types of tampering for digital images. Detection methods generally use block-matching approaches, which first divide the image into overlapping blocks and then extract and compare features to find similar ones, or point-based approaches, in which relevant keypoints are extracted and matched to each other to find similar areas. In this paper we prese...
متن کاملMinimizing edge length to connect sparsely sampled unstructured point sets
Most methods for interpolating unstructured point clouds handle densely sampled point sets quite well but get into trouble when the point set contains regions with much sparser sampling, a situation often encountered in practice. In this paper, we present a new method that provides a better interpolation of sparsely sampled features. We pose the surface construction problem as finding the trian...
متن کاملMeshes Preserving Minimum Feature Size
The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. When a polygon is partitioned into a mesh, the degradation is the ratio of original to final minimum feature size. We show that some planar straight-line graphs cannot be triangulated with constant degradation, even with an unbounded number of Steiner points and triangles. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011